The spectra of multiplicative attribute graphs
نویسندگان
چکیده
منابع مشابه
The Spectra of Multiplicative Attribute Graphs
A multiplicative attribute graph is a random graph in which vertices are represented by random words of length t in a finite alphabet Γ, and the probability of adjacency is a symmetric function Γt×Γt → [0, 1]. These graphs are a generalization of stochastic Kronecker graphs, and both classes have been shown to exhibit several useful real world properties. We establish asymptotic bounds on the s...
متن کاملQuilting Stochastic Kronecker Product Graphs to Generate Multiplicative Attribute Graphs
We describe the first sub-quadratic sampling algorithm for the Multiplicative Attribute Graph Model (MAGM) of Kim and Leskovec (2010). We exploit the close connection between MAGM and the Kronecker Product Graph Model (KPGM) of Leskovec et al. (2010), and show that to sample a graph from a MAGM it suffices to sample small number of KPGM graphs and quilt them together. Under a restricted set of ...
متن کاملEfficiently Sampling Multiplicative Attribute Graphs Using a Ball-Dropping Process
In this talk I will describe the first sub-quadratic sampling algorithm for the Multiplicative Attribute Graph Model (MAGM, Kim and Leskove 2010). To design our algorithm, we first define a stochastic ball-dropping process (BDP). Although a special case of this process was introduced as an efficient approximate sampling algorithm for the Kronecker Product Graph Model (KPGM, Leskovec et al 2010)...
متن کاملOn multiplicative Zagreb indices of graphs
Todeschini et al. have recently suggested to consider multiplicative variants of additive graph invariants, which applied to the Zagreb indices would lead to the multiplicative Zagreb indices of a graph G, denoted by ( ) 1 G and ( ) 2 G , under the name first and second multiplicative Zagreb index, respectively. These are define as ( ) 2 1 ( ) ( ) v V G G G d v and ( ) ( ) ( ) ( ) 2...
متن کاملINTEGER-MAGIC SPECTRA OF CYCLE RELATED GRAPHS
For any h in N , a graph G = (V, E) is said to be h-magic if there exists a labeling l: E(G) to Z_{h}-{0} such that the induced vertex set labeling l^{+: V(G) to Z_{h}} defined by l^{+}(v)= Summation of l(uv)such that e=uvin in E(G) is a constant map. For a given graph G, the set of all for which G is h-magic is called the integer-magic spectrum of G and is denoted by IM(G). In this paper, the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2014
ISSN: 0024-3795
DOI: 10.1016/j.laa.2014.07.047